Combining Sub-symbolic and Symbolic Methods for Explainability
نویسندگان
چکیده
Similarly to other connectionist models, Graph Neural Networks (GNNs) lack transparency in their decision-making. A number of sub-symbolic approaches have been developed provide insights into the GNN decision making process. These are first important steps on way explainability, but generated explanations often hard understand for users that not AI experts. To overcome this problem, we introduce a conceptual approach combining and symbolic methods human-centric explanations, incorporate domain knowledge causality. We furthermore notion fidelity as metric evaluating how close explanation is GNN's internal The evaluation with chemical dataset ontology shows explanatory value reliability our method.
منابع مشابه
Merging Sub-symbolic and Symbolic Computation
In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational weighted) neural nets, using bounded resources. This fact was achieved by creating a neural programming language called NETDEF, such that each program corresponds to a modular neural net that computes it. This fr...
متن کاملA Framework for Integrating Symbolic and Sub-Symbolic Representations
This paper establishes a framework that hierarchically integrates symbolic and sub-symbolic representations in an architecture for cognitive robotics. It is formalised abstractly as nodes in a hierarchy, with each node a sub-task that maintains its own belief-state and generates behaviour. An instantiation is developed for a real robot building towers of blocks, subject to human interference; t...
متن کاملNeural Sub-Symbolic Reasoning
The sub-symbolical representation often corresponds to a pattern that mirrors the way the biological sense organs describe the world. Sparse binary vectors can describe sub-symbolic representation, which can be efficiently stored in associative memories. According to the production system theory, we can define a geometrically based problemsolving model as a production system operating on sub-sy...
متن کاملCombining diagrammatic and symbolic reasoning
We introduce a domain-independent framework for heterogeneous natural deduction that combines diagrammatic and sentential reasoning. The framework is presented in the form of a family of denotational proof languages (DPLs). Diagrams are represented as possibly partial descriptions of finite system states. This allows us to deal with incomplete information, which we formalize by admitting sets a...
متن کاملCombining Local Consistency, Symbolic Rewriting and Interval Methods
This paper is an attempt to address the processing of nonlinear numerical constraints over the Reals by combining three different methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we define a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-91167-6_12